Network Identification With Latent Nodes via Autoregressive Models
نویسندگان
چکیده
منابع مشابه
Network identification with latent nodes via auto-regressive models
We consider linear time-invariant networks with unknown interaction topology where only a subset of the nodes, termed manifest, can be directly controlled and observed. The remaining nodes are termed latent and their number is also unknown. Our goal is to identify the transfer function of the manifest subnetwork and determine whether interactions between manifest nodes are direct or mediated by...
متن کاملLatent Autoregressive Gaussian Process Models for Robust System Identification
We introduce GP-RLARX, a novel Gaussian Process (GP) model for robust system identification. Our approach draws inspiration from nonlinear autoregressive modeling with exogenous inputs (NARX) and it encapsulates a novel and powerful structure referred to as latent autoregression. This structure accounts for the feedback of uncertain values during training and provides a natural framework for fr...
متن کاملConfident Network Indices with Latent Space Models
Although traditional social network analysis operates on the assumption that the observed relationships represents the true social network, this assumption is dangerous, especially in noisy environments. This assumption is especially problematic given the lack of robustness with respect to missing or erroneous information that has been found for node-level network indices such as degree central...
متن کاملStatistical Inference in Autoregressive Models with Non-negative Residuals
Normal residual is one of the usual assumptions of autoregressive models but in practice sometimes we are faced with non-negative residuals case. In this paper we consider some autoregressive models with non-negative residuals as competing models and we have derived the maximum likelihood estimators of parameters based on the modified approach and EM algorithm for the competing models. Also,...
متن کاملOn Identification via EM with Latent Disturbances and Lagrangian Relaxation
In the application of the Expectation Maximization (EM) algorithm to identification of dynamical systems, latent variables are typically taken as system states, for simplicity. In this work, we propose a different choice of latent variables, namely, system disturbances. Such a formulation is shown, under certain circumstances, to improve the fidelity of bounds on the likelihood, and circumvent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2018
ISSN: 2325-5870
DOI: 10.1109/tcns.2017.2754372